منابع مشابه
On the separation of disjunctive cuts
Disjunctive cuts for Mixed-Integer Linear Programs have been introduced by Egon Balas in the late 70’s, and successfully exploited in practice since the late 90’s. In this paper we investigate the main ingredients of a disjunctive cut separation procedure, and analyze their impact on the quality of the root-node bound for a set of instances taken from MIPLIB library. We compare alternative norm...
متن کاملOn the Rank of Disjunctive Cuts
Let L be a family of lattice-free polyhedra in R containing the splits. Given a polyhedron P in R, we characterize when a valid inequality for P ∩(Z×R) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in L. We also characterize the lattice-free polyhedra M such that all the disjunctive cuts corresponding to M can be obtained with a finite number of disjunc...
متن کاملA convex-analysis perspective on disjunctive cuts
We treat the general problem of cutting planes with tools from convex analysis. We emphasize the case of disjunctive polyhedra and the generation of facets. We conclude with some considerations on the design of eÆcient cut generators.
متن کاملOn Disjunctive Cuts for Combinatorial Optimization
In the successful branch-and-cut approach to combinatorial optimization, linear inequalities are used as cutting planes within a branch-and-bound framework. Although researchers often prefer to use facet-inducing inequalities as cutting planes, good computational results have recently been obtained using disjunctive cuts, which are not guaranteed to be facet-inducing in general. A partial expla...
متن کاملDisjunctive Cuts for Nonconvex Minlp
Mixed Integer Nonlinear Programming (MINLP) problems present two main challenges: the integrality of a subset of variables and nonconvex (nonlinear) objective function and constraints. Many exact solvers for MINLP are branch-and-bound algorithms that compute a lower bound on the optimal solution using a linear programming relaxation of the original problem. In order to solve these problems to o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2009
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-009-0300-y